
#include"Search for a binary tree.h"

int main()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BStree<int> t;
	for (auto i : a)
	{
		t.insert(i);
	}
	t.InOrder();
	t.Erase(8);
	t.InOrder();
	t.Erase(14);
	t.InOrder();

	return 0;
}